Foveation Techniques and Scheduling Issues in Thinwire Visualization

نویسندگان

  • Ee-Chien Chang
  • Chee Yap
چکیده

To my family iii Acknowledgments Firstly I wish to express my gratitude to my advisor, Professor Chee Yap. Without his encouragement, support, guidance and the occasional prodding, none of this would have been possible. In addition, I would like to acknowledge with gratitude Professor Stéphane Mallat for his invaluable advice and help in all matters involving wavelets. I would also like to thank Professor Eero Simoncelli and other members of my thesis committee for their suggestions and patience. Special thanks to all my friends who make my stay in New York City a very memorable one.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Realtime Visualization of Large Images over a Thinwire

We investigate realtime techniques for visualization of very large images over a thinwire. We exploit multi-foveated images which have extremely favorable data density, as compared to uniform resolution images. To compensate for the loss of uniform resolution, we now allow the user new dynamic controls over the visualization process. Current servers of large images on the net (e.g., map servers...

متن کامل

Responsive scalable thinwire visualization: application to large geographic datasets

When very large datasets are visualized in a thinwire setting, where the bandwidth is both limited and unreliable, current techniques break down. This paper proposes the responsive visualization system as a solution. We describe the architecture of such a system, and algorithmic challenges to support it. We introduce a natural and scalable visualization interface called the zooming telescope. W...

متن کامل

Competitive Online Scheduling with Level of Service

Motivated by an application in thinwire visualization, we study an abstract on-line scheduling problem where the size of each requested service can be scaled down by the scheduler. We give two schedulers FirstFit and EndFit based on two simple heuristics, and generalize them into a class of greedy schedulers. We show that both FirstFit and EndFit are 2-competitive, and any greedy scheduler is 3...

متن کامل

A THEORETICALLY CORRECT RESOURCE USAGE VISUALIZATION FOR THE RESOURCE-CONSTRAINED PROJECT SCHEDULING PROBLEM

The cumulative resource constraints of the resource-constrained project scheduling problem (RCPSP) do not treat the resource demands as geometric rectangles, that is, activities are not necessarily assigned to the same resource units over their processing times. In spite of this fact, most papers on resource-constrained project scheduling mainly in the motivation phase use a strip packing of re...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1998